Two Topics in Applied Algorithmics Two Topics in Applied Algorithmics Submitted by I Coarse Grained Parallel Computing on Heterogeneous Systems 1

نویسندگان

  • Patrick R. Morin
  • Evangelos Kranakis
  • Anil Maheshwari
  • Ben Juurlink
چکیده

This thesis examines two largely unrelated problems in applied algorithmics, motivated by the search for e cient geometric algorithms. In the rst part of the thesis, we consider the problem of nding e cient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which di erent processors have di erent computational potential. To this end, we de ne a formal computational model for heterogeneous systems and develop algorithms for commonly used communication operations. The result is that many existing parallel algorithms which use these communication operations can be adapted to our model with little or no modi cations. In the second part of the thesis we consider the problem of geometric models which allow for varying levels of detail. To this end, we extend the progressive mesh representation introduced by Hoppe. The main technical contribution of this part is an e cient scheme for re ning only selected regions of a progressive mesh. Using this scheme, we develop important applications in the elds of computational geometry and geographic information systems. Both parts of the thesis are supported by experimental results which show that our algorithms are of considerable practical relevance. iii Acknowledgements A number of people have been instrumental in the completion of this thesis, and I would like to acknowledge them here. While writing this thesis I received funding from the Natural Science and Engineering Research Council of Canada and Almerco. It goes without saying that this was greatly appreciated. Jorg Sack has proven to be an excellent supervisor. There are many reasons for this, but the most important of these is his dedication to, and willingness to work for, his students. Anil Maheshwari has provided input on many aspects of this thesis. It is because of his comments and questions that many of the ideas in this thesis are developed to the extent that they are. While writing parts of this thesis, I was lucky to have been a visitor at the Heinz Nixdorf Institut at the Universat GH-Paderborn. During this time, Ben Juurlink gave comments which signi cantly improved the presentation of the rst part of this thesis. Finally I would like to thank Silvia Gotz for having supported me throughout the writing of this thesis, both as a colleague and close friend. For this I am especially grateful. iv

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A PRAM-on-Chip Vision (invited abstract)

Explicit Multi-Threading (XMT) is a fine-grained computation framework introduced in our SPAA‘98 paper. XMT aims at faster single-task completion time by way of instruction-level parallelism (ILP). Building on some key ideas from parallel computing, XMT covers the spectrum from algorithms through architecture to implementation; the main implementation related innovation in XMT was through the i...

متن کامل

GIS Infrastructure in Japan — Developments and Algorithmic Researches

Some activities of geographical data maintenance and standardization work in GIS infrastructures in Japan are first reviewed. Then, from the viewpoint of geometric and combinatorial algorithmics, applied aspects of GIS are described. Some spatial data mining technique is mentioned first, and then the problem of inferring topological information from digital map and the label placement problem a...

متن کامل

BOOKS THAT NEED REVIEWERS FOR THE SIGACT NEWS COLUMN Algorithms 1. ReCombinatorics: The algorithmics of ancestral recombination graphs and phylogenic networks by Gusfield. 2. Distributed Systems: An algorithmic approach (second edition) by Ghosh. 3. Tractability: Practical approach to Hard Problems

4. Polyhedral and Algebraic Methods in Computational Geometry, by Michael Joswig and Thorsten Theobald. Reviewed by Brittany Terese Fasy and David L. Millman. This book treats a wide array of topics, beginning from the basics (e.g., convex hulls) and proceeding through the fundamental tools of computational algebraic geometry (e.g., Gröbner bases), and containing a section on applications as well.

متن کامل

Experimental Algorithmics Applied to On-line Machine Learning

The application of methods from experimental algorithmics to on-line or streaming data is referred to as experimental algorithmics for streaming data (EADS). This paper proposes an experimental methodology for on-line machine learning algorithms, i.e., for algorithms that work on data that are available in a sequential order. It is demonstrated how established tools from experimental algorithmi...

متن کامل

Mobile Computing: Opportunities for Parallel Algorithms Research

The last thirty years have seen trmendous growth in research in mobile telemcommunications. However, interest in mobile computing, which includes mobile telephony and more, has increased over the last ten years. Nevertheless, most of the research on mobile computing addresses the “engineering” issues and the electronic componentary required for building mobile systems. On the other hand, algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998